a(x1) → b(c(x1))
a(b(b(x1))) → c(a(a(a(x1))))
c(c(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
a(x1) → b(c(x1))
a(b(b(x1))) → c(a(a(a(x1))))
c(c(x1)) → x1
A(b(b(x1))) → A(x1)
A(b(b(x1))) → C(a(a(a(x1))))
A(x1) → C(x1)
A(b(b(x1))) → A(a(x1))
A(b(b(x1))) → A(a(a(x1)))
a(x1) → b(c(x1))
a(b(b(x1))) → c(a(a(a(x1))))
c(c(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
A(b(b(x1))) → A(x1)
A(b(b(x1))) → C(a(a(a(x1))))
A(x1) → C(x1)
A(b(b(x1))) → A(a(x1))
A(b(b(x1))) → A(a(a(x1)))
a(x1) → b(c(x1))
a(b(b(x1))) → c(a(a(a(x1))))
c(c(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
A(b(b(x1))) → A(x1)
A(b(b(x1))) → A(a(x1))
A(b(b(x1))) → A(a(a(x1)))
a(x1) → b(c(x1))
a(b(b(x1))) → c(a(a(a(x1))))
c(c(x1)) → x1
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(b(b(x1))) → A(x1)
A(b(b(x1))) → A(a(x1))
Used ordering: Polynomial interpretation [25,35]:
A(b(b(x1))) → A(a(a(x1)))
The value of delta used in the strict ordering is 64.
POL(c(x1)) = x_1
POL(a(x1)) = 4 + (4)x_1
POL(A(x1)) = (4)x_1
POL(b(x1)) = 4 + (4)x_1
a(x1) → b(c(x1))
a(b(b(x1))) → c(a(a(a(x1))))
c(c(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
A(b(b(x1))) → A(a(a(x1)))
a(x1) → b(c(x1))
a(b(b(x1))) → c(a(a(a(x1))))
c(c(x1)) → x1